The double centralizer algebra as a linear space
نویسندگان
چکیده
منابع مشابه
A Modified Brauer Algebra as Centralizer Algebra of the Unitary Group
The centralizer algebra of the action of U(n) on the real tensor powers ⊗RV of its natural module, V = Cn, is described by means of a modification in the multiplication of the signed Brauer algebras. The relationships of this algebra with the invariants for U(n) and with the decomposition of ⊗RV into irreducible submodules is considered.
متن کاملCanonical Bases for the Brauer Centralizer Algebra
In this paper we construct canonical bases for the Birman-Wenzl algebra BWn, the q-analogue of the Brauer centralizer algebra, and so define left, right and two-sided cells. We describe these objects combinatorially (generalizing the Robinson-Schensted algorithm for the symmetric group) and show that each left cell carries an irreducible representation of BWn. In particular, we obtain canonical...
متن کاملThe Quantum Double as a Hopf Algebra
In the last lecture we have learned that the category of modules over a braided Hopf algebra H is a braided monoidal category. A braided Hopf algebra is a rather sophisticated algebraic object, it is not easy to give interesting nontrivial examples. In this text we develop a theory that will lead to a concrete recipe which produces a nontrivial braided Hopf algebra D(A) (called Drinfeld’s quant...
متن کاملBounded Treewidth and Space-Efficient Linear Algebra
Motivated by a recent result of Elberfeld, Jakoby and Tantau[EJT10] showing that MSO properties are Logspace computable on graphs of bounded tree-width, we consider the complexity of computing the determinant of the adjacency matrix of a bounded tree-width graph and as our main result prove that it is in Logspace. It is important to notice that the determinant is neither an MSO-property nor cou...
متن کاملLinear Algebra . A publication of the International Linear Algebra Society
Nonnegative nilpotent lower triangular completions of a nonnegative nilpotent matrix are studied. It is shown that for every natural number between the index of the matrix and its order, there exists a completion that has this number as its index. A similar result is obtained for the rank. However, unlike the case of complex completions of complex matrices, it is proved that for every nonincrea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1975
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1975-0407613-7